Fast Arithmetic Operations over F 2 n for Software Implementation
نویسندگان
چکیده
This paper discusses the representation of a nite eld with characteristic 2, and proposes arithmetic operations over the eld using a successive extension of the eld. We develop a fast inversion algorithm, and compare its speed with the previous algorithms, and consider their applications. We con rm that our algorithm is e ective and suitable for software implementation.
منابع مشابه
Secure Arithmetic Computation with Constant Computational Overhead
We study the complexity of securely evaluating an arithmetic circuit over a finite field F in the setting of secure two-party computation with semi-honest adversaries. In all existing protocols, the number of arithmetic operations per multiplication gate grows either linearly with log |F| or polylogarithmically with the security parameter. We present the first protocol that only makes a constan...
متن کاملFast Fourier Transforms for Symmetric Groups: Theory and Implementation
Recently, it has been proved that a Fourier transform for the symmetric group S„ based on Young's seminormal form can be evaluated in less than 0.5(h3 + n2)n\ arithmetic operations. We look at this algorithm in more detail and show that it allows an efficient software implementation using appropriate data structures. We also describe a similarly efficient algorithm for the inverse Fourier trans...
متن کاملA Fast Algorithm for Gaussian Elimination over GF(2) and Its Implementation on the GAPP
A fast algori thm for Gaussian eliminat ion over GF(2) is proposed. The proposed algorithm employs binary search technique to locate l s along the colum ns of the large binary matrix being triangular ized. T he algori thm requires 2m 2 + m log211 2m bit operations to triang ularize an II X m matrix on a bit-array with 11 processors and m + 2 + l"log2nl bits of vertica l memory per processor . D...
متن کاملBIT 39(3), pp. 539–560, 1999 FAST AND PARALLEL INTERVAL ARITHMETIC
Infimum-supremum interval arithmetic is widely used because of ease of implementation and narrow results. In this note we show that the overestimation of midpoint-radius interval arithmetic compared to power set operations is uniformly bounded by a factor 1.5 in radius. This is true for the four basic operations as well as for vector and matrix operations, over real and over complex numbers. Mo...
متن کاملFAST FOURIER TRANSFORMS OVER PRIME FIELDS OF LARGE CHARACTERISTIC AND THEIR IMPLEMENTATION ON GRAPHICS PROCESSING UNITS (Thesis format: Monograph) by
Prime field arithmetic plays a central role in computer algebra and supports computation in Galois fields which are essential to coding theory and cryptography algorithms. The prime fields that are used in computer algebra systems, in particular in the implementation of modular methods, are often of small characteristic, that is, based on prime numbers that fit on a machine word. Increasing pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007